A heuristic approach to minimize three criteria using efficient solutions

In <span>optimization, scheduling problems is concerning allocations of some resources which are usually limited. These done in order to fulfil criterion by performing tasks or jobs optimize one more objective functions. Simultaneous multi-criteria problem known as np-hard optimization problem. Here, we consider three criteria for a number on single machine. The minimize the sum total completion time, maximum earliness and tardiness. Every job be processed without interruption becomes available processing at time zero. aim find three-objective functions simultaneously. We present new heuristic approach best overall solution (accepted) using efficient solutions other related criteria. establish result restrict range optimal solution, lower bound depends decomposition into subproblems. tested set different jobs. Computational results demonstrate efficiency proposed approach.</span>